Simple permutations of the classes Av(321, 13524) and Av(321, 13452) have polynomial growth
نویسندگان
چکیده
A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a permutation is a pattern which is minimal under involvement and do not belong to the permutation. In this paper, we prove that the number of simple permutations an of the pattern class with two basis of length 3 and 5 such as Av(321, 13452) and Av(321, 13524) have polynomial growth.
منابع مشابه
Simple permutations of the classes Av(321, 3412) and Av(321, 4123) have polynomial growth
A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a class of permutations is a set of patterns, which is minimal under involvement and do not belong to the permutation. In this paper we prov...
متن کاملUniversity ’ s repository of research publications and other research outputs Growth rates for subclasses of Av ( 321 )
Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does n...
متن کامل’ s repository of research publications and other research outputs Growth rates for subclasses of Av ( 321 )
Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does n...
متن کاملGrowth Rates for Subclasses of Av(321)
Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does n...
متن کاملRecounted by Murray Elder and Vince Vatter
A permutation is an arrangement of a finite number of distinct elements of a linear order, for example, e, π, 0, √ 2 and 3412. Two permutations are order isomorphic if the have the same relative ordering. We say a permutation τ contains or involves a permutation β if deleting some of the entries of π gives a permutation that is order isomorphic to β, and we write β ≤ τ . For example, 534162 (wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJCOPI
دوره 2 شماره
صفحات -
تاریخ انتشار 2011